Challenges for Constraint Reasoning and Optimization in Computational Sustainability
نویسنده
چکیده
Computational Sustainability is a new emerging research field with the overall goal of studying and providing solutions to computational problems for balancing environmental, economic, and societal needs for a sustainable future. I will provide examples of challenge problems in Computational Sustainability, ranging from wildlife preservation and biodiversity, to balancing socio-economic needs and the environment, to large-scale deployment and management of renewable energy sources, highlighting overarching computational themes in constraint reasoning and optimization and interactions with machine learning, and dynamical systems. I will also discuss the need for a new approach to study such challenging problems in which computational problems are viewed as “natural” phenomena, amenable to a scientific methodology in which principled experimentation, to explore problem parameter spaces and hidden problem structure, plays as prominent a role as formal analysis.
منابع مشابه
Challenges for CPAIOR in Computational Sustainability
The notions of sustainability and sustainable development were first introduced in the seminal report of the United Nations World Commission on Environment and Development, known as the Brundtland report or Our Common Future [3]. Sustainable development is “development that meets the needs of the present without compromising the ability of future generations to meet their needs.” Sustainability...
متن کاملAn effective method based on the angular constraint to detect Pareto points in bi-criteria optimization problems
The most important issue in multi-objective optimization problems is to determine the Pareto points along the Pareto frontier. If the optimization problem involves multiple conflicting objectives, the results obtained from the Pareto-optimality will have the trade-off solutions that shaping the Pareto frontier. Each of these solutions lies at the boundary of the Pareto frontier, such that the i...
متن کاملWhat's Hot in Constraint Programming
The CP conference is the annual international conference on constraint programming. It is concerned with all aspects of computing with constraints, including theory, algorithms, environments, languages, models, systems, and applications such as decision-making, resource allocation, scheduling, configuration, and planning. The CP community is very keen to ensure it remains open to interdisciplin...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملDistributed Constraint Handling and Optimization
Constraints pervade our everyday lives and are usually perceived as elements that limit solutions to the problems that we face (e.g., the choices we make everyday are typically constrained by limited money or time). However, from a computational point of view, constraints are key components for efficiently solving hard problems. In fact, constraints encode knowledge about the problem at hand, a...
متن کامل